Semi‐labeled unrooted binary tree optimization subject to nonnegativity
نویسندگان
چکیده
Let D n × denote the distance matrix of objects, and let T be an unrooted binary tree in which leaves those objects. We want to find such a with constraint that edge weights are nonnegative where distances between best estimate their corresponding values D. Accordingly, we have adopted residual sum squares (RSS) criterion minimize discrepancy For this optimization problem, designed iterated local search (ILS) scheme based on nearest neighbor interchange (NNI) operation neighborhood.
منابع مشابه
Tree-Based Unrooted Phylogenetic Networks
Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An unrooted phylogenetic network on a non-empty, finite set X of taxa, or network, is a connected, simple graph in which every vertex has degree 1 or 3 and whose leaf set is...
متن کاملCounting Unrooted Maps Using Tree Decomposition
This talk presents a new method to count unrooted maps on the sphere. This method is based on tree decomposition More precisely it gives enumerations of 2-connected and 3connected unrooted maps with a complexity of O(N log(N)) for maps with e ≤ N edges and O(N) for maps with i vertices and j faces i + j ≤ N . The family of 3-connected unrooted maps corresponds to the skeletons of polytopes in t...
متن کاملRNA Tree Comparisons via Unrooted Unordered Alignments
(c) Fig. S1: Homeomorphic Subtree Alignment. Dashed lines represent the alignment (a) An HSA A = {(a, a′), (b, b′), . . . , (g, g′)} between two trees T and S. The set of pruned subtrees (in green fillings) with respect to A is π(A) = { T a h , T k l , S c′ i′ } . The set of smoothed nodes (in red and waved) with respect to A is δ(A) = {k, h′}. (b) The subtrees T ′ and S′ of T and S, respective...
متن کاملTree-Based Unrooted Nonbinary Phylogenetic Networks
Phylogenetic networks are a generalisation of phylogenetic trees that allow for more complex evolutionary histories that include hybridisation-like processes. It is of considerable interest whether a network can be considered ‘tree-like’ or not, which lead to the introduction of tree-based networks in the rooted, binary context. Tree-based networks are those networks which can be constructed by...
متن کاملProtein classification based on propagation of unrooted binary trees.
We present two efficient network propagation algorithms that operate on a binary tree, i.e., a sparse-edged substitute of an entire similarity network. TreeProp-N is based on passing increments between nodes while TreeProp-E employs propagation to the edges of the tree. Both algorithms improve protein classification efficiency.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2022
ISSN: ['0028-3045', '1097-0037']
DOI: https://doi.org/10.1002/net.22090